The smallest vertex-primitive 2-arc-transitive digraph

نویسندگان

چکیده

In 2017, Giudici, Li and the third author constructed first known family of vertex-primitive 2-arc-transitive digraphs valency at least 2. The smallest digraph in this admits PSL3(49) acting 2-arc-transitively with vertex-stabilizer A6 hence has 30758154560 vertices. paper, we prove that is 2 fewest

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finite vertex-primitive and vertex-biprimitive 2-path-transitive graphs

This paper presents a classification of vertex-primitive and vertex-biprimitive 2-path-transitive graphs which are not 2-arc-transitive. The classification leads to constructions of new examples of half-arc-transitive graphs.

متن کامل

Finite vertex primitive 2-arc regular graphs

A classification is given of finite graphs that are vertex primitive and 2arc regular. The classification involves various new constructions of interesting 2-arc transitive graphs.

متن کامل

An Infinite Highly Arc-transitive Digraph

The main purpose of this note is to construct an infinite , highly arc-transitive digraph with finite out-valency , and with out-spread greater than 1 , which does not have the two-way infinite path Z as a homomorphic image . This answers Question 3 . 8 in the paper [3] of Cameron , Praeger and Wormald . Our digraph has infinite in-valency . By a result of Praeger (see [5]) , a connected , vert...

متن کامل

The vertex primitive and vertex bi-primitive s-arc regular graphs

A complete classification is given of vertex primitive and vertex bi-primitive s-arc regular graphs with s ≥ 3. In particular, it is shown that the Petersen graph and Coxeter graph are the only vertex primitive 3-arc regular graphs, and that vertex bi-primitive 3-arc regular graphs consist of the complete bipartite graph K3,3, the standard double covers of the Petersen graph and Coxeter graph, ...

متن کامل

Quartic half-arc-transitive graphs with large vertex stabilizers

A 1 2 -arc-transitive graph is a vertexand edgebut not arc-transitive graph. In all known constructions of quartic 1 2 -arc-transitive graphs, vertex stabilizers are isomorphic to Z 2,Z 2 2 or to D8. In this article, for each positive integer m ≥ 1, an infinite family of quartic 1 2 -arctransitive graphs having vertex stabilizers isomorphic to Z m

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 2023

ISSN: ['1090-266X', '0021-8693']

DOI: https://doi.org/10.1016/j.jalgebra.2023.02.028